Representation%2C composition and application of preferences in databases.

Explaining structured queries in natural language.

Recsplorer recommendation algorithms based on precedence mining.

Personalizing queries based on networks of composite preferences.

Guest editorial Special issue on collective intelligence.

Social Systems Can We Do More Than Just Poke Friends%3F
Social sites have become extremely popular among users but have they attracted equal attention from the research community? Are they good only for simple tasks, such as tagging and poking friends? Do they present any new or interesting research challenges? In this paper, we describe the insights we have obtained implementing CourseRank, a course evaluation and planning social system. We argue that more attention should be given to social sites like ours and that there are many challenges (though not the traditional DBMS ones) that should be addressed by our community. 1.
CourseCloud summarizing and refining keyword searches over structured data.

Data clouds summarizing keyword search results over structured data.
Keyword searches are attractive because they facilitate users searching structured databases. On the other hand, tag clouds are popular for navigation and visualization purposes over unstructured data because they can highlight the most significant concepts and hidden relationships in the underlying content dynamically. In this paper, we propose coupling the flexibility of keyword searches over structured data with the summarization and navigation capabilities of tag clouds to help users access a database. We propose using clouds over structured data (data clouds) to summarize the results of keyword searches over structured data and to guide users to refine their searches. The cloud presents the most significant words associated with the search results. Our keyword search model allows searching for entities than can span multiple tables in the database rather than just tuples, as existing keyword searches over databases do. We present several methods to compute the scores both for the entities and for the terms in the search results. We describe algorithms for keyword searches with data clouds and we present our system, CourseCloud, that offers a unified search and browse interface to a course database. We present experimental results showing (a) the appropriateness of the methods used for scoring terms, (b) the performance of the proposed algorithms, and (c) the effectiveness of CourseCloud compared to typical search and browse interfaces to a course database. 1.


CourseRank A Closed%2DCommunity Social System through the Magnifying Glass.

CourseRank a social system for course planning.

Entity resolution with iterative blocking.
Entity Resolution (ER) is the problem of identifying which records in a database refer to the same real-world entity. An exhaustive ER process involves computing the similarities between pairs of records, which can be very expensive for large datasets. Various blocking techniques can be used to enhance the performance of ER by dividing the records into blocks in multiple ways and only comparing records within the same block. However, most blocking techniques process blocks separately and do not exploit the results of other blocks. In this paper, we propose an iterative blocking framework where the ER results of blocks are reflected to subsequently processed blocks. Blocks are now iteratively processed until no block contains any more matching records. Compared to simple blocking, iterative blocking may achieve higher accuracy because reflecting the ER results of blocks to other blocks may generate additional record matches. Iterative blocking may also be more efficient because processing a block now saves the processing time for other blocks. We implement a scalable iterative blocking system and demonstrate that iterative blocking can be more accurate and efficient than blocking for large datasets.
FlexRecs expressing and combining flexible recommendations.

Social Systems Can we Do More Than Just Poke Friends%3F
Social sites have become extremely popular among users but have they attracted equal attention from the research community? Are they good only for simple tasks, such as tagging and poking friends? Do they present any new or interesting research challenges? In this paper, we describe the insights we have obtained implementing CourseRank, a course evaluation and planning social system. We argue that more attention should be given to social sites like ours and that there are many challenges (though not the traditional DBMS ones) that should be addressed by our community. 1.
Social sites research through CourseRank.
Social sites such as FaceBook, Orkut, Flickr, MySpace and many others have become immensely popular. At these sites, users share their resources (e.g., photos, profiles, blogs) and learn from each other. On the other hand, higher education applications help students and administrators track and manage academic information such as grades, course evaluations and enrollments. Despite the importance of both these areas, there is relatively little research on the mechanisms that make them effective. Apart from being both a successful social site and an academic planning site, CourseRank provides a live testbed for studying fundamental questions related to social networking, academic planning, and the fusion of these areas. In this paper, we provide a system overview and our main research efforts through CourseRank. 1.
Third int%27l workshop on %22personalized access
Proliferation of database-driven web sites has brought upon a plethora of information access and dissemination applications. Monitoring and trading stock portfolios, news notification, weather tracking, and even simple search are just a few examples. In addition,
Flexible recommendations over rich data.

Can social bookmarking improve web search%3F

Combating spam in tagging systems An evaluation.

OLAP Cubes for Social Searches Standing on the Shoulders of Giants%3F
The advent of social bookmarking has signaled a new era towards a more “pluralistic ” web, where entities of multiple types (e.g., users, resources, tags) can coexist and get interconnected. In this paper, we propose going beyond classical searches for resources based on keywords to exploring social data starting from any type of entity, i.e., user, resource or annotation, and requesting aggregated views of related entities based on the relationships defined between entities. We map this type of social searching to OLAP query processing bridging the gap between OLAP and the social web and we study various ways to support on-the-fly aggregations of social data. We further describe how data cubes can be used for precomputing and materializing the results of all possible aggregate queries over a social dataset. Our experiments show that cubes can efficiently support searches over social data and they particularly fit searches that combine popular entities over large datasets.
Combating spam in tagging systems An evaluation.

Pr%E9cis from unstructured keywords as queries to structured databases as answers.

Combating Spam in Tagging Systems.
Tagging systems allow users to interactively annotate a pool of shared resources using descriptive tags. As tagging systems are gaining in popularity, they become more susceptible to tag spam: misleading tags that are generated in order to increase the visibility of some resources or simply to confuse users. We introduce a framework for modeling tagging systems and user tagging behavior. We also describe a method for ranking documents matching a tag based on taggers ’ reliability. Using our framework, we study the behavior of existing approaches under malicious attacks and the impact of a moderator and our ranking method. Categories and Subject Descriptors H.3.3 [Information Search and Retrieval]: [Retrieval models, Search process]; H.3.5 [Online Information Services]: [Data sharing, Web-based services]
Generalized Pr%E9cis Queries for Logical Database Subset Creation.

Fighting Spam on Social Web Sites A Survey of Approaches and Future Challenges.

An Enhanced Search Interface for Information Discovery from Digital Libraries.

Comprehensible Answers to Pr%E9cis Queries.

An Enhanced Search Interface for Information Discovery from Digital Libraries.

Pattern%2DBased Query Answering.

Pr%E9cis The Essence of a Query Answer.

Personalized Queries under a Generalized Preference Model.

Constrained Optimalities in Query Personalization.

Personalized Systems Models and Methods from an IR and DB Perspective.

Database Query Personalization.
Approximate string matching is used for spelling correction and personal name matching. In this paper we show how to use string matching techniques in conjunction with lexicon indexes to find approximate matches in a large lexicon. We test several lexicon indexing techniques, including n-grams and permuted lexicons, and several string matching techniques, including string similarity measures and phonetic coding. We propose methods for combining these techniques, and show experimentally that these combinations yield good retrieval effectiveness while keeping index size and retrieval time low. Our experiments also suggest that, in contrast to previous claims, phonetic codings are markedly inferior to string distance measures, which are demonstrated to be suitable for both spelling correction and personal name matching. KEY WORDS: pattern matching; string indexing; approximate matching; compressed inverted files; Soundex
Personalization of Queries in Database Systems.
journal homepage: www.elsevier.com/locate/knosys
Personalization of Queries based on User Preferences.

Rule%2Dbased query personalization in digital libraries.

